Developing Self-stabilizing Coloring Algorithms via Systematic Randomization
نویسندگان
چکیده
We consider the problem of designing uniform self-stabilizing distributed algorithms for coloring chains and oriented rings. We provide deterministic uniform self-stabilizing algorithms for some of the problems , and impossibility results for the other problems. For problems in the latter class, we present random-ized self-stabilizing algorithms. These results lead to a general method for obtaining randomized self-stabilizing algorithms.
منابع مشابه
Probabilistic Self-stabilizing Vertex Coloring in Unidirectional Anonymous Networks
A distributed algorithm is self-stabilizing if after faults and attacks hit the system and place it in some arbitrary global state, the system recovers from this catastrophic situation without external intervention in finite time. Unidirectional networks preclude many common techniques in self-stabilization from being used, such as preserving local predicates. The focus of this work is on the c...
متن کاملSelf-stabilizing Algorithms for Graph Coloring with Improved Performance Guarantees
In the self-stabilizing model we consider a connected system of autonomous asynchronous nodes, each of which has only local information about the system. Regardless of the initial state, the system must achieve a desirable global state by executing a set of rules assigned to each node. The paper deals with the construction of a solution to graph coloring in this model, a problem motivated by co...
متن کاملAnalyzing the Fault-Containment Time of Self-Stabilizing Algorithms - A Case Study for Graph Coloring
The paper presents techniques to derive upper bounds for the mean time to recover from a single fault for self-stabilizing algorithms in the message passing model. For a new ∆ + 1-coloring algorithm we analytically derive a bound for the mean time to recover and show that the variance is bounded by a small constant independent of the network’s size. For the class of bounded-independence graphs ...
متن کاملSelf-Stabilizing Algorithms For Orderings And Colorings
A k-forward numbering of a graph is a labeling of the nodes with integers such that each node has less than k neighbors whose labels are equal or larger. Distributed algorithms that reach a legitimate state, starting from any illegitimate state, are called self-stabilizing. We obtain three self-stabilizing (s-s) algorithms for finding a k-forward numbering, provided one exists. One such algorit...
متن کاملCompact Self-Stabilizing Leader Election for Arbitrary Networks
We present a self-stabilizing leader election algorithm for arbitrary networks, with spacecomplexity Opmaxtlog∆, log lognuq bits per node in n-node networks with maximum degree ∆. This space complexity is sub-logarithmic in n as long as ∆ “ n. The best space-complexity known so far for arbitrary networks was Oplog nq bits per node, and algorithms with sublogarithmic space-complexities were know...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1994